Recursive Twig Pattern Query
نویسندگان
چکیده
منابع مشابه
Recursive Twig Pattern Query
XQuery is a language for querying XML data which is widely used on the Internet. In XQuery, user can define recursive functions for querying and processing XML data. XML twig pattern query is considered as core operation for querying XML data which has been studied intensively in recent years. More powerful recursive queries can be achieved via combining user-defined recursive function and twig...
متن کاملEfficient XML Dissemination Scheme for Twig Pattern Query Processing
Tremendous advancement in technology most of the people are using their cell phone to access internet anywhere and everywhere. So, they need to concentrate on battery power also because of the limited battery power. In this paper, we propose an energy and latency efficient XML dissemination scheme for the wireless devices. We define a new unit structure called G-node for sending XML data in the...
متن کاملTwigTable: Using Semantics in XML Twig Pattern Query Processing
In this paper, we demonstrate how the semantic information, such as value, property, object class and relationship between object classes in XML data impacts XML query processing. We show that the lack of using semantics causes different problems in value management and content search in existing approaches. Motivated on solving these problems, we propose a semantic approach for XML twig patter...
متن کاملTwig Pattern Matching: A Revisit
Twig pattern matching plays a crucial role in xml query processing. In order to reduce the processing time, some existing holistic onephase twig pattern matching algorithms (e.g., HolisticTwigStack [3], TwigFast [5], etc) use the core function getNext of TwigStack [2] to effectively and efficiently filter out the useless elements. However, using getNext as a filter may incur other redundant com...
متن کاملPractical Indexing XML Document for Twig Query
Answering structural queries of XML with index is an important approach of efficient XML query processing. Among existing structural indexes for XML data, F&B index is the smallest index that can answer all branching queries. However, an F&B index for less regular XML data often contains a large number of index nodes, and hence a large amount of main memory. If the F&B index cannot be accommoda...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Database Theory and Application
سال: 2014
ISSN: 2005-4270
DOI: 10.14257/ijdta.2014.7.3.16